Dynamic Pricing Through Sampling Based Optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Pricing through Sampling Based Optimization

Citation Lobel, Ruben, and Georgia Perakis. "Dynamic pricing through sampling based optimization." The 51st Airline Group of the International Federation of Operational Research Societies (AGIFORS) Annual Proceedings, Antalya, Turkey, October 1014, 2011. As Published http://toc.proceedings.com/13874webtoc.pdf Publisher Airline Group of the International Federation of Operational Research Societies

متن کامل

Dynamic Pricing Through Data Sampling

In this paper we study a dynamic pricing problem, where a firm offers a product to be sold over a fixed time horizon. The firm has a given initial inventory level, but there is uncertainty about the demand for the product in each time period. The objective of the firm is to determine a robust and dynamic pricing strategy that maximizes revenue over the entire selling season. We develop a tracta...

متن کامل

Thompson Sampling for Dynamic Pricing

In this paper we apply active learning algorithms for dynamic pricing in a prominent e-commerce website. Dynamic pricing involves changing the price of items on a regular basis, and uses the feedback from the pricing decisions to update prices of the items. Most popular approaches to dynamic pricing use a passive learning approach, where the algorithm uses historical data to learn various param...

متن کامل

Dynamic Network-Based Discriminatory Pricing

We study the dynamic pricing decisions for competitive network service providers. We assume that each competing firm follows a three-part pricing scheme, which consists of an ongoing membership fee, a usage fee for communications within the networks, and another usage fee for communications across the networks. The difference between the two usage fees is the network-based price discount that a...

متن کامل

Faster Optimization through Adaptive Importance Sampling

The current state of the art stochastic optimization algorithms (SGD, SVRG, SCD, SDCA, etc.) are based on sampling one active datapoint uniformly at random in each iteration. Changing these probabilities to better reflect the importance of each datapoint is a natural and powerful idea. In this thesis we analyze Stochastic Coordinate Descent methods with fixed non-uniform and adaptive sampling. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2010

ISSN: 1556-5068

DOI: 10.2139/ssrn.1748426